The Generalized Impressionistic Texture Matrix Generator

نویسندگان

  • F. Kenton Musgrave
  • Myeong Lim
چکیده

We describe a system for determining a random palette providing color juxtaposition in digital images, both synthetic and scanned. The result can be significantly increased visual richness and sophistication in color usage. The Generalized Impressionistic Texture Matrix Generator F. Kenton Musgrave Myeong Lim The George Washington University 20101 Academic Way Ashburn, VA 22011 (703) 729-8254 (703) 729-8251 (fax) [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix-Variate Beta Generator - Developments and Application

Matrix-variate beta distributions are applied in different fields of hypothesis testing, multivariate correlation analysis, zero regression, canonical correlation analysis and etc. A methodology is proposed to generate matrix-variate beta generator distributions by combining the matrix-variate beta kernel with an unknown function of the trace operator. Several statistical characteristics, exten...

متن کامل

Generalized Cooccurrence Matrix to Classify IRS-1D Images using Neural Network

This paper presents multispectral texture analysis for classification based on a generalized cooccurrence matrix. Statistical and texture features have been obtained from the first order probability distribution and generalized cooccurrence matrix. The features along with the gray value of the selected pixels are fed into the neural network. Frist, Self Organizing Map (SOM) that is an unsupervi...

متن کامل

Generalized co-occurrence matrix for multispectral texture analysis

We present a new cooccurrence matrix based approach for multispectral texture analysis. The spectral and spatial domains of the multispectral textures are processed separately. The color space used in this study is represented by subspaces and it is class$ed by the averaged learning subspace method (ALSM). In the spatial domain we use a generalized cooccurrence matrix for vector valued pixels. ...

متن کامل

On the spectra of reduced distance matrix of the generalized Bethe trees

Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.

متن کامل

The Jacobsthal Sequences in Finite Groups

Abstract In this paper, we study the generalized order- Jacobsthal sequences modulo for and the generalized order-k Jacobsthal-Padovan sequence modulo for . Also, we define the generalized order-k Jacobsthal orbit of a k-generator group for and the generalized order-k Jacobsthal-Padovan orbit a k-generator group for . Furthermore, we obtain the lengths of the periods of the generalized order-3 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007